Grover’s Algorithm applied to the Molecular Distance Geometry Problem
نویسندگان
چکیده
Grover’s algorithm is a quantum algorithm for searching in unstructured databases. Due to the properties of quantum mechanics, it provides a quadratic speedup over its classical counterparts. We present a new application of the algorithm to the Molecular Distance Geometry Problem. This problem is related to the determination of the tridimensional structure of a molecule based on the knowledge of some of the distances between pairs of atoms. This problem is NP-hard unless all possible inter-atomic distances are known.
منابع مشابه
(n,1,1,α)-Center Problem
Given a set of points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrain...
متن کاملA linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
We describe a linear-time algorithm for solving the molecular distance geometry problem with exact distances between all pairs of atoms. This problem needs to be solved in every iteration of general distance geometry algorithms for protein modeling such as the EMBED algorithm by Crippen and Havel (Distance Geometry and Molecular Conformation, Wiley, 1988). However, previous approaches to the pr...
متن کاملA Clifford Algebra approach to the Discretizable Molecular Distance Geometry Problem
The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملDouble variable neighbourhood search with smoothing for the molecular distance geometry problem
We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem, and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective fun...
متن کامل